Calculating Dempster-Shafer Plausibility
نویسنده
چکیده
A sufficient condition is developed for the equality of the plausibility and commonality measures of the Dempster-Shafer belief calculus. When the condition is met, as it is in many applications, an efficient method to calculate relative plausibility is available. In particular, the method can be used to calculate the relative plausibility of atomic hypotheses and, therefore, it can be used to find the choice that maximizes this measure. The computation is efficient enough to make Dempster-Shafer practical in some domains where computational complexity would otherwise counter-indicate its use.
منابع مشابه
A Study on Properties of Dempster-Shafer Theory to Probability Theory transformations
In this paper, five conditions that have been proposed by Cobb and Shenoy are studied for nine different mappings from the Dempster-Shafer theory to the probability theory. After comparing these mappings, one of the considerable results indicates that none of the mappings satisfies the condition of invariance with respect to the marginalization process. In more details, the main reason for this...
متن کاملThe Dempster-Shafer Theory Algorithm and its Application to Insect Diseases Detection
This paper presents Dempster-Shafer Theory for insect diseases detection. Sustainable elimination of insect diseases as a public-health problem is feasible and requires continuous efforts and innovative approaches. In this research, we used Dempster-Shafer theory for detecting insect diseases and displaying the result of detection process. Insect diseases which include babesiosis, dengue fever,...
متن کاملObjective Evaluation of Subjective Decisions
The Dempster-Shafer “theory of evidence” encompasses and extends the Bayes Theorem-based decision making machinery. Dempster-Shafer’s innovation is the introduction of lower and upper bounds, designated “belief” and “plausibility”, that are attached to probability estimates. The Dempster-Shafer algebra provides for propagation of and reasoning about these quantities according to an algebra whos...
متن کاملUsing the Dempster-Shafer Theory of Evidence to Resolve ABox Inconsistencies
Automated ontology population using information extraction algorithms can produce inconsistent knowledge bases. Confidence values assigned by the extraction algorithms may serve as evidence helping to repair produced inconsistencies. The Dempster-Shafer theory of evidence is a formalism, which allows appropriate interpretation of extractors’ confidence values. The paper presents an algorithm fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Pattern Anal. Mach. Intell.
دوره 13 شماره
صفحات -
تاریخ انتشار 1991